Which Is the Worst-Case Nash Equilibrium?
نویسندگان
چکیده
A Nash equilibrium of a routing network represents a stable state of the network where no user finds it beneficial to unilaterally deviate from its routing strategy. In this work, we investigate the structure of such equilibria within the context of a certain game that models selfish routing for a set of n users each shipping its traffic over a network consisting of m parallel links. In particular, we are interested in identifying the worst-case Nash equilibrium – the one that maximizes social cost. Worst-case Nash equilibria were first introduced and studied in the pioneering work of Koutsoupias and Papadimitriou [9]. More specifically, we continue the study of the Conjecture of the Fully Mixed Nash Equilibrium, henceforth abbreviated as FMNE Conjecture, which asserts that the fully mixed Nash equilibrium, when existing, is the worst-case Nash equilibrium. (In the fully mixed Nash equilibrium, the mixed strategy of each user assigns (strictly) positive probability to every link.) We report substantial progress towards identifying the validity, methodologies to establish, and limitations of, the FMNE Conjecture.
منابع مشابه
Nash equilibrium strategy in the deregulated power industry and comparing its lost welfare with Iran wholesale electricity market
With the increasing use of different types of auctions in market designing, modeling of participants’ behaviors to evaluate the market structure is one of the main discussions in the studies related to the deregulated power industries. In this article, we apply an approach of the optimal bidding behavior to the Iran wholesale electricity market as a restructured electric power industry and mode...
متن کاملWorst - case
In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the eeectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a very simple network leads to some interesting mathematics, results, and open problems.
متن کاملOn the Structure and Complexity of Worst-Case Equilibria
We study an intensively studied resource allocation game introduced by Koutsoupias and Papadimitriou where n weighted jobs are allocated to m identical machines. It was conjectured by Gairing et al. that the fully mixed Nash equilibrium is the worst Nash equilibrium for this game w. r. t. the expected maximum load over all machines. The known algorithms for approximating the so-called “price of...
متن کاملWorst-case Equilibria
In a system where noncooperative agents share a common resource, we propose the price of anarchy, which is the ratio between the worst possible Nash equilibrium and the social optimum, as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model where several agents share a very simple network leads to some interesting mathematics, results, and open...
متن کاملPrice of Airline Frequency Competition
Frequency competition influences capacity allocation decisions in airline markets and has important implications to airline profitability and airport congestion. Market share of a competing airline is a function of its frequency share and the relationship between the two is pivotal for understanding the impacts of frequency competition on airline business. Based on the most commonly accepted fo...
متن کامل